Optimal Randomized Partial Checking for Decryption Mix Nets
نویسندگان
چکیده
One of the most important verifiability techniques for mix nets is randomized partial checking (RPC). This method employed in a number prominent secure e-voting systems, including Pret Voter, Civitas, and Scantegrity II, some which have also been used real political elections Australia.
منابع مشابه
Making Mix Nets Robust for Electronic Voting by Randomized Partial Checking
We propose a new technique for making mix nets robust, called randomized partial checking (RPC). The basic idea is that rather than providing a proof of completely correct operation, each server provides strong evidence of its correct operation by revealing a pseudo-randomly selected subset of its input/output relations. Randomized partial checking is exceptionally efficient compared to previou...
متن کاملInformation Leakage in Mix Networks with Randomized Partial Checking
We present a previously unknown vulnerability of mix networks (mix nets) that use pseudorandom permutations and that are audited with randomized partial checking (RPC). Our method relies on two simple observations: A mix that generates pseudorandom permutations only generates a limited subset of all possible permutations; in practical cases, RPC exposes enough information to uniquely identify t...
متن کاملRandomized Partial Checking Revisited
We study mix-nets with randomized partial checking (RPC) as proposed by Jakobsson, Juels, and Rivest (2002). RPC is a technique to verify the correctness of an execution both for Chaumian and homomorphic mix-nets. The idea is to relax the correctness and privacy requirements to achieve a more efficient mix-net. We identify serious issues in the original description of mix-nets with RPC and show...
متن کاملMarked Mix-Nets
We propose a variant mix-net method, which we call a “marked mix-net” . Marked mix-nets avoid the extra cost associated with verifiability (producing a proof of correct mixing operation), while offering additional assurances about the privacy of the messages, compared to a non-verifiable mix-net. With a marked mix-net, each mix-server adds an extra secret mark in each ciphertext, and the input ...
متن کاملComputationally efficient mix-nets
The current online voting system used in Estonia has not employed mathematically secure verifiable proofs of correctness for ensuring the honesty of the tabulation server [Com13a]. The auditing is based on observation of the procedures and if the procedures are done according to the protocol. Even though the protocol was not followed, as the cast votes were transferred from ballot storing serve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2021
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-030-90567-5_14